Optimal Tree Topology for a Submarine Cable Network With Constrained Internodal Latency

This paper provides an optimized cable path planning solution for a tree-topology network in irregular 2D manifold 3D Euclidean space, with application to the of submarine networks. Our method is based on total cost minimization, where individual costs are assumed be linear length corresponding cables subject latency constraints between pairs nodes. These limit and number hops any pair combines Fast Marching Method (FMM) new Integer Linear Programming (ILP) formulation Minimum Spanning Tree (MST) there We note that this problem MST NP-complete. Nevertheless, we demonstrate ILP running time adequate great majority existing systems. For systems which not able find optimal within acceptable time, propose alternative heuristic algorithm Prim's algorithm. In addition, apply our FMM/ILP-based real-world example it can effectively